Constrained Visualization Using the Shepard Interpolation Family
نویسندگان
چکیده
منابع مشابه
Constrained Visualization Using the Shepard Interpolation Family
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive. We show how the Modified Quadratic Shepard method, which interpolates scattered data of any dimensionality, can be constrained to preserve positivity. We do this by forcing the quadratic basis functions to be positive...
متن کاملConstrained Shepard Method for Modeling and Visualization of Scattered Data
The problem of modeling and visualization of scattered data where there are inherent constraints on value of the data exists in many scientific and business research areas. For example, the value of mass concentration always has the lower bound of 0 and upper bound of 1. The modeling functions having gradient continuity usually do not guarantee to preserve the bounds of data. In this paper we p...
متن کاملConstrained Visualization of 2D Positive Data using Modified Quadratic Shepard Method
This paper is about the visualization of positive data subject to positivity constraint. It presents an algorithm that produces a non-negative graph through scattered positive data sets using Modified Quadratic Shepard method. The objective of positivity has been achieved by scaling of basis functions as far as it is necessary. This method is improved in that it produces the positive graph with...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملSolving Constrained Horn Clauses using Interpolation
We present an interpolation-based method for symbolically solving systems of constrained Horn clauses. The method can be used to solve for unknown predicates in the verification conditions of programs. Thus, it has a variety of applications, including including model checking of recursive and threaded programs. The method is implemented in tool called Duality, which we evaluate using device dri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2005
ISSN: 0167-7055,1467-8659
DOI: 10.1111/j.1467-8659.2005.00903.x